Pierre - Alain Reynier Diagonal Constraints handled efficiently in UPPAAL Research Report LSV - 07 - 02 January 2007
نویسنده
چکیده
Timed automata (TA) are widely used to model real-time systems, and UPPAAL is one of the most popular model-checker for this framework which has been successfully applied over numerous industrial case studies. Diagonal constraints are a natural extension of TA, that does not increase expressive power, but gives conciseness. Unfortunately the classical forward algorithm for reachability analysis cannot be used to deal directly with diagonal constraints. Thus the current method implemented consists in removing them on-the-fly, which implies a complexity blow-up. In [8], a counter-example guided refinement algorithm has been proposed. In this paper, we present its implementation, and give some benchmarks on a variant of Fischer’s protocol.
منابع مشابه
Patricia Bouyer , Serge Haddad and Pierre - Alain Reynier Extended Timed Automata and Time Petri Nets Research Report LSV - 06 - 01 January 2006
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability properties and timed languages has been proposed, which does however not extend to larger classes of TA which would allow diagonal constraints or more general resets of clocks. Though these features do not add express...
متن کاملDiagonal Constraints in Timed Automata: Forward Analysis of Timed Systems
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability properties. Though diagonal constraints do not add expressive power to classical TA, the standard forward analysis algorithm is not correct for this model. In this paper we survey several approaches to handle diagona...
متن کاملP . Bouyer , N . Markey and P . A . Reynier Robust Model - Checking of Timed Automata Research Report LSV - 05 - 08 June 2005
Recent works by Raskin et al. have brought out a model of parameterized timed automata which can be used for proving that timed systems are implementable. This is strongly connected to robustly verifying timed automata, i.e. verifying whether a property still holds even if the transitions may be slightly delayed or expedited. In those works, they have proved decidability of robust model-checkin...
متن کاملAutomatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study
In this paper, we show how to apply recent tools for the automatic synthesis of robust and near-optimal controllers for a real industrial case study. We show how to use three different classes of models and their supporting existing tools, UPPAAL-TIGA for synthesis, PHAVER for verification, and SIMULINK for simulation, in a complementary way. We believe that this case study shows that our tools...
متن کاملForward Analysis of Timed Automata
Timed automata constitute a well adapted model for real-time aspects. However, a classical forward analysis algorithm used to verify safety properties has been showed to be incorrect in the general framework of timed automata. Nevertheless, it is correct when we restrict the class to timed automata with only non-diagonal guards. The aim of this work is to understand the role of diagonal guards ...
متن کامل